Convex hull ranking algorithm for multi-objective evolutionary algorithms

Convex hull ranking algorithm for multi-objective evolutionary algorithms

Convex hull; Non-dominated solutions; Multi-objective evolutionary algorithms; Complexity; Ranking procedure. Abstract Due tomany applications of multi-objective evolutionary algorithms in real world optimization problems, several studies have been done to improve these algorithms in recent years. Since most multi-objective evolutionary algorithms are based on the non-dominated principle, and t...

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

Multi-Objective Evolutionary Algorithms

Evolutionary Multi-Objective Algorithms

The versatility that genetic algorithm (GA) has proved to have for solving different problems, has make it the first choice of researchers to deal with new challenges. Currently, GAs are the most well known evolutionary algorithms, because their intuitive principle of operation and their relatively simple implementation; besides they have the ability to reflect the philosophy of evolutionary co...

Multi-Objective Evolutionary Algorithms

Real world optimization problems are often too complex to be solved through analytical means. Evolutionary algorithms, a class of algorithms that borrow paradigms from nature, are particularly well suited to address such problems. These algorithms are stochastic methods of optimization that have become immensely popular recently, because they are derivative-free methods, are not as prone to get...